FASTER AND SIMPLER ALGORITHMS FOR MULTICOMMODITY FLOW AND OTHER FRACTIONAL PACKING PROBLEMSGARG, Naveen; KÖNEMANN, Jochen.SIAM journal on computing (Print). 2008, Vol 37, Num 2, pp 630-652, issn 0097-5397, 23 p.Article

STRICT COST SHARING SCHEMES FOR STEINER FORESTSCHÄFER, Guido; FLEISCHER, Lisa; KÖNEMANN, Jochen et al.SIAM journal on computing (Print). 2010, Vol 39, Num 7-8, pp 3616-3632, issn 0097-5397, 17 p.Article

Approximating the degree-bounded minimum diameter spanning tree problemKÖNEMANN, Jochen; LEVIN, Asaf; SINHA, Amitabh et al.Algorithmica. 2005, Vol 41, Num 2, pp 117-129, issn 0178-4617, 13 p.Article

Distributed weighted vertex cover via maximal matchingsGRANDONI, Fabrizio; KÖNEMANN, Jochen; PANCONESI, Alessandro et al.Lecture notes in computer science. 2005, pp 839-848, issn 0302-9743, isbn 3-540-28061-8, 10 p.Conference Paper

Multicommodity Flow in Trees: Packing via Covering and Iterated RelaxationKÖNEMANN, Jochen; PAREKH, Ojas; PRITCHARD, David et al.Algorithmica. 2014, Vol 68, Num 3, pp 776-804, issn 0178-4617, 29 p.Article

A partition-based relaxation for Steiner treesKÖNEMANN, Jochen; PRITCHARD, David; KUNLUN TAN et al.Mathematical programming (Print). 2011, Vol 127, Num 2, pp 345-370, issn 0025-5610, 26 p.Article

Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper boundCHAKRABARTY, Deeparnab; KÖNEMANN, Jochen; PRITCHARD, David et al.Operations research letters. 2010, Vol 38, Num 6, pp 567-570, issn 0167-6377, 4 p.Article

A Unified Approach to Approximating Partial Covering ProblemsKONEMANN, Jochen; PAREKH, Ojas; SEGEV, Danny et al.Algorithmica. 2011, Vol 59, Num 4, pp 489-509, issn 0178-4617, 21 p.Article

A unified approach to approximating partial covering problemsKÖNEMANN, Jochen; PAREKH, Ojas; SEGEV, Danny et al.Lecture notes in computer science. 2006, pp 468-479, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 12 p.Conference Paper

Quasi-polynomial time approximation algorithm for low-degree minimum-cost Steiner treesKÖNEMANN, Jochen; RAVI, R.Lecture notes in computer science. 2003, pp 289-301, issn 0302-9743, isbn 3-540-20680-9, 13 p.Conference Paper

Non-clairvoyant scheduling for minimizing mean slowdownBANSAL, Nikhil; DHAMDHERE, Kedar; KÖNEMANN, Jochen et al.Algorithmica. 2004, Vol 40, Num 4, pp 305-318, issn 0178-4617, 14 p.Article

Simple cost sharing schemes for multicommodity rent-or-buy and stochastic steiner treeFLEISCHER, Lisa; KÖNEMANN, Jochen; LEONARDI, Stefano et al.Annual ACM symposium on theory of computing. 2006, pp 663-670, isbn 1-59593-134-1, 1Vol, 8 p.Conference Paper

Improved approximations for tour and tree coversKÖNEMANN, Jochen; KONJEVOD, Goran; PAREKH, Ojas et al.Algorithmica. 2004, Vol 38, Num 3, pp 441-449, issn 0178-4617, 9 p.Conference Paper

Approximation algorithms for edge-dilation k-center problemsKÖNEMANN, Jochen; YANJUN LI; PAREKH, Ojas et al.Lecture notes in computer science. 2002, pp 210-219, issn 0302-9743, isbn 3-540-43866-1, 10 p.Conference Paper

Approximating k-hop minimum-spanning treesALTHAUS, Ernst; FUNKE, Stefan; HAR-PELED, Sariel et al.Operations research letters. 2005, Vol 33, Num 2, pp 115-120, issn 0167-6377, 6 p.Article

A GROUP-STRATEGYPROOF COST SHARING MECHANISM FOR THE STEINER FOREST GAMEKÖNEMANN, Jochen; LEONARDI, Stefano; SCHÄFER, Guido et al.SIAM journal on computing (Print). 2008, Vol 37, Num 5, pp 1319-1341, issn 0097-5397, 23 p.Article

From primal-dual to cost shares and back : A stronger LP relaxation for the steiner forest problemKÖNEMANN, Jochen; LEONARDI, Stefano; SCHÄFER, Guido et al.Lecture notes in computer science. 2005, pp 930-942, issn 0302-9743, isbn 3-540-27580-0, 13 p.Conference Paper

The School Bus Problem on TreesBOCK, Adrian; GRANT, Elyot; KÖNEMANN, Jochen et al.Algorithmica. 2013, Vol 67, Num 1, pp 49-64, issn 0178-4617, 16 p.Conference Paper

Cut problems in graphs with a budget constraintENGELBERG, Roee; KÖNEMANN, Jochen; LEONARDI, Stefano et al.Lecture notes in computer science. 2006, pp 435-446, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

Approximating the degree-bounded minimum diameter spanning tree problemKÖNEMANN, Jochen; LEVIN, Asaf; SINHA, Amitabh et al.Lecture notes in computer science. 2003, pp 109-121, issn 0302-9743, isbn 3-540-40770-7, 13 p.Conference Paper